RNC-Approximation Algorithms for the Steiner Problem
نویسندگان
چکیده
In this paper we present an RNC-algorithm for nding a minimum spanning tree in a weighted 3-uniform hypergraph, assuming the edge weights are given in unary, and a fully polynomial time randomized approximation scheme if the edge weights are given in binary. From this result we then derive RNC-approximation algorithms for the Steiner problem in networks with approximation ratio (1 +) 5=3 for all > 0.
منابع مشابه
Parallel Approximation Algorithms for Maximum Weighted Matching in General Graphs
The problem of computing a matching of maximum weight in a given edge-weighted graph is not known to be P-hard or in RNC. This paper presents four parallel approximation algorithms for this problem. The first is an RNC-approximation scheme, i.e., an RNC algorithm that computes a matching of weight at least 1 − times the maximum for any given constant > 0. The second one is an NC approximation a...
متن کاملParalle Approximation Algorithms for Maximum Weighted Matching in General Graphs
The problem of computing a matching of maximum weight in a given edge-weighted graph is not known to be P-hard or in RNC. This paper presents four parallel approximation algorithms for this problem. The rst is an RNC-approximation scheme, i.e., an RNC algorithm that computes a matching of weight at least 1 times the maximum for any given constant > 0. The second one is an NC approximation algor...
متن کاملA 2-approximation NC algorithm for connected vertex cover and tree cover
The connected vertex cover problem is a variant of the vertex cover problem, in which a vertex cover is additional required to induce a connected subgraph in a given connected graph. The problem is known to be NP-hard and to be at least as hard to approximate as the vertex cover problem is. While several 2-approximation NC algorithms are known for vertex cover, whether unweighted or weighted, n...
متن کاملOn approximation algorithms for the terminal Steiner tree problem
The terminal Steiner tree problem is a special version of the Steiner tree problem, where a Steiner minimum tree has to be found in which all terminals are leaves. We prove that no polynomial time approximation algorithm for the terminal Steiner tree problem can achieve an approximation ratio less than (1− o(1)) lnn unless NP has slightly superpolynomial time algorithms. Moreover, we present a ...
متن کاملParallelized approximation algorithms for minimum routing cost spanning trees
Let G = (V,E) be an undirected graph with a nonnegative edgeweight function w. The routing cost of a spanning tree T of G is ∑ u,v∈V dT (u, v), where dT (u, v) denotes the weight of the simple u-v path in T. The Minimum Routing Cost Spanning Tree (MRCT) problem [WLB+00] asks for a spanning tree of G with the minimum routing cost. In this paper, we parallelize several previously proposed approxi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997